منابع مشابه
A two-stage intelligent search algorithm for the two-dimensional strip packing problem
This paper presents a two-stage intelligent search algorithm for a two-dimensional strip packing problem without guillotine constraint. In the first stage, a heuristic algorithm is proposed, which is based on a simple scoring rule that selects one rectangle from all rectangles to be packed, for a given space. In the second stage, a local search and a simulated annealing algorithm are combined t...
متن کاملA Two-Stage Hybrid Flowshop Scheduling Problem with Serial Batching
In this paper the problem of serial batch scheduling in a two-stage hybrid flow shop environment with minimizing Makesapn is studied. In serial batching it is assumed that jobs in a batch are processed serially, and their completion time is defined to be equal to the finishing time of the last job in the batch. The analysis and implementation of the prohibited transference of jobs among the mac...
متن کاملGreedy Seeding Procedure for GAs Solving a Strip Packing Problem
In this paper, the two-dimensional strip packing problem with 3-stage level patterns is tackled using genetic algorithms (GAs). We evaluate the usefulness of a knowledge-based greedy seeding procedure used for creating the initial population. This is motivated by the expectation that the seeding will speed up the GA by starting the search in promising regions of the search space. An analysis of...
متن کاملTwo-stage Procedure in P-Order Autoregressive Process
In this paper, the two-stage procedure is considered for autoregressive parameters estimation in the p-order autoregressive model ( AR(p)). The point estimation and fixed-size confidence ellipsoids construction are investigated which are based on least-squares estimators. Performance criteria are shown including asymptotically risk efficient, asymptotically efficient, and asymptotically consist...
متن کاملA New Search Procedure for the Two-dimensional Orthogonal Packing Problem
In this paper we propose a new exact procedure for the two-dimensional orthogonal packing problem, based on F. Clautiaux et al. approach [4]. The principle consists in searching first the positions of the items on the horizontal axis, so as that, at each position, the sum of the heights of the items does not exceed the height of the bin. Each time a valid placement of all the items is encounter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Transactions in Operational Research
سال: 2016
ISSN: 0969-6016
DOI: 10.1111/itor.12251